Lower bounds for moments of L-functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bounds for moments of L-functions.

The moments of central values of families of L-functions have recently attracted much attention and, with the work of Keating and Snaith [(2000) Commun. Math. Phys. 214, 57-89 and 91-110], there are now precise conjectures for their limiting values. We develop a simple method to establish lower bounds of the conjectured order of magnitude for several such families of L-functions. As an example ...

متن کامل

5 Lower Bounds for Moments of L - Functions

Abstract. The moments of central values of families of L-functions have recently attracted much attention and, with the work of Keating and Snaith, there are now precise conjectures for their limiting values. We develop a simple method to establish lower bounds of the conjectured order of magnitude for several such families of L-functions. As an example we work out the case of the family of all...

متن کامل

Lower Bounds for Moments of L-functions: Symplectic and Orthogonal Examples

An important problem in number theory asks for asmptotic formulas for the moments of central values of L-functions varying in a family. This problem has been intensively studied in recent years, and thanks to the pioneering work of Keating and Snaith [7], and the subsequent contributions of Conrey, Farmer, Keating, Rubinstein and Snaith [1], and Diaconu, Goldfeld and Hoffstein [3] there are now...

متن کامل

Lower Bounds for Moments of Automorphic L-functions over Short Intervals

Let L(s, π) be the principal L-function attached to an irreducible unitary cuspidal automorphic representation π of GLm(AQ). The aim of the paper is to give a simple method to show the lower bounds of mean value for automorphic L-functions over short intervals.

متن کامل

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 2005

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.0501723102